Exploiting Blockage in VLC Networks Through User Rotations
نویسندگان
چکیده
منابع مشابه
Exploiting Delay Patterns for User IPs Identification in Cellular Networks
A surprisingly high number of mobile carriers worldwide do not block unsolicited traffic from reaching their mobile devices from the open Internet or from within the cellular network. This exposes mobile users to a class of lowresource attacks that could compromise their privacy and security. In this work we describe a methodology that allows an adversary to identify a victim device in the cell...
متن کاملQuantifying the Benefits of Exploiting User Profiles in Cellular Networks
The manner in which users cross cell boundaries in a cellular network has a high degree of predictability due to temporal and spatial locality in user mobility. This is so because user typically take predictable routes during specific times of the day, and these routes cut across cell coverage areas in an ordered sequence. This mobility information on a per-user basis, referred to as user profi...
متن کاملFeature Extraction through Rotations
A procedure is developed for obtaining the lower dimensional representation of highdimensional observations stemming from different classes that best distinguishes among the classes. The method finds a low dimensional subspace such that the estimated probability of the projected data belonging to each population is as close to the true assignment as possible. This is achieved by starting from a...
متن کاملAn efficient VLC decompression scheme for user-defined coding tables
With the increase of information and data types, high-throughput and flexible memory-based VLC decoder is required for userdefined coding tables to achieve higher compression ratio. In this paper, we present a memory-based VLC decoder which is quite suitable for the applications with user-defined tables. By parallel loading data into memories, the coding tables can be changed with much less tim...
متن کاملRelaxed Balance through Standard Rotations
We consider binary search trees, where rebalancing transformations need not be connected with updates but may be delayed. For standard AVL tree rebalancing, we prove that even though the rebalancing operations are un-coupled from updates, their total number is bounded by O(M log(M +N)), where M is the number of updates to an AVL tree of initial size N. Hence, relaxed balancing of AVL trees come...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Open Journal of the Communications Society
سال: 2020
ISSN: 2644-125X
DOI: 10.1109/ojcoms.2020.3010021